منابع مشابه
Applying Logic Synthesis for Speeding Up SAT
SAT solvers are often challenged with very hard problems that remain unsolved after hours of CPU time. The research community meets the challenge in two ways: (1) by improving the SAT solver technology, for example, perfecting heuristics for variable ordering, and (2) by inventing new ways of constructing simpler SAT problems, either using domain specific information during the translation from...
متن کاملSpeeding up snakes
In this paper we summarize new and existing approaches for the semiautomatic image segmentation based on active contour models. In order to replace the manual segmentation of images of the medical research of the Center of Anatomy at the Georg August University of Göttingen we developed a user interface based on snakes. Due to the huge images (sometimes bigger than 100 megapixels) the research ...
متن کاملSpeeding up Dynamic Programming
A number of important computational problems in molecular biology, geology, speech recognition, and other areas, can be expressed as recurrences which have typically been solved with dynamic programming. By using more sophisticated data structures, and by taking advantage of further structure from the applications, we speed up the computation of several of these recurrences by one or two orders...
متن کاملSpeeding up QUAD
QUAD is a provable secure stream cipher based on multivariate polynomials which was proposed in 2006 by Berbain, Gilbert and Patarin [1]. In this paper we show how to speed up QUAD over GF(256) by a factor of up to 5.8. We get this by using structured systems of polynomials, in particular partially circulant polynomials and polynomials generated by a linear recurring sequence (LRS), instead of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2016
ISSN: 0362-1340,1558-1160
DOI: 10.1145/3022671.2984006